Projecting interval uncertainty through the discrete Fourier transform: An application to time signals with poor precision
نویسندگان
چکیده
The discrete Fourier transform (DFT) is often used to decompose a signal into finite number of harmonic components. efficient and rigorous propagation the error present in through can be computationally challenging. Real data always subject imprecision because measurement uncertainty. For example, such uncertainty may come from sensors whose precision affected by degradation, or simply digitisation. On many occasions, only bounds on known, thus it necessary automatically propagate without making additional artificial assumptions. This paper presents method that interval DFT while yielding exact amplitude an estimation Power Spectral Density (PSD) function. allows technical analysts project – time signals PSD function assumptions about dependence distribution over steps. Thus, possible calculate analyse system responses frequency domain conducting extensive Monte Carlo simulations nor running expensive optimisations domain. applicability this practice demonstrated application. It also shown conventional methods severely underestimate
منابع مشابه
Fractional Fourier series expansion for finite signals and dual extension to discrete-time fractional Fourier transform
Conventional Fourier analysis has many schemes for different types of signals. They are Fourier transform (FT), Fourier series (FS), discrete-time Fourier transform (DTFT), and discrete Fourier transform (DFT). The goal of this correspondence is to develop two absent schemes of fractional Fourier analysis methods. The proposed methods are fractional Fourier series (FRFS) and discrete-time fract...
متن کاملUncertainty relations and minimum uncertainty states for the discrete Fourier transform and the Fourier series
Abstract The conventional Fourier transform has a well-known uncertainty relation that is defined in terms of the first and second moments of both a function and its Fourier transform. It is also well known that Gaussian functions, when translated to an arbitrary centre and supplemented by a linear phase factor, provide a complete set of minimum uncertainty states (MUSs) that exactly satisfies ...
متن کاملReassigned time-frequency representations of discrete time signals and application to the Constant-Q Transform
In this paper we provide a formal justification of the use of time-frequency reassignment techniques on time-frequency transforms of discrete time signals. State of the art techniques indeed rely on formulae established in the continuous case which are applied, in a somehow inaccurate manner, to discrete time signals. Here, we formally derive a general framework for discrete time reassignment. ...
متن کاملThe Discrete Fourier Transform∗
1 Motivation We want to numerically approximate coefficients in a Fourier series. The first step is to see how the trapezoidal rule applies when numerically computing the integral (2π) −1 2π 0 F (t)dt, where F (t) is a continuous, 2π-periodic function. Applying the trapezoidal rule with the stepsize taken to be h = 2π/n for some integer n ≥ 1 results in (2π) −1 2π 0 F (t)dt ≈ 1 n n−1 j=0 Y j , ...
متن کاملThe Discrete Fourier Transform
Disclaimer: These notes are intended to be an accessible introduction to the subject, with no pretense at completeness. In general, you can find more thorough discussions in Oppenheim's book. Please let me know if you find any typos. In this lecture, we discuss the Discrete Fourier Transform (DFT), which is a fourier representation for finite length signals. The main practical importance of thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mechanical Systems and Signal Processing
سال: 2022
ISSN: ['1096-1216', '0888-3270']
DOI: https://doi.org/10.1016/j.ymssp.2022.108920